Genetic algorithmic based approach for multiple-objective probabilistic fractional programming problem involving discrete random variables

This manuscript presents a technique for solving a multiple-objective probabilistic fractional programming problem with discrete random variables. A multiple-objective probabilistic mathematical model is constructed with fractional objectives. In the model, some parameters of coefficients and right hand side parameters of restrictions are assumed as random variables having Pascal and Hyper geometric distributions. The feasibility of probabilistic constraints is checked by means of stochastic simulation. Genetic algorithm approach method is used to obtain the Pareto optimal solution of the proposed model without finding the deterministic model. Genetic algorithm parameters are fixed in all generation. The proposed method is coded by C++ programming language. To illustrate the method, a numerical example and practical example on the case of supply chain management are presented. The result shows that the values of the objective functions are conflicting each other.


Introduction
Fractional mathematical programming is a programming problem where the cost function is the quotient of functions. It is applied when the constraints and cost functions are certain in nature. In other way some real life programming problems have unknown parameters due to uncertain nature. In this case, the uncertainty is handled by using probabilistic programming problem or fuzzy programming problem. A probabilistic fractional programming problems is a mathematical model with some or all data are assumed as random variables.
Optimizing many conflicting fractional objective with respect to the given restrictions is considered as multiple-objective fractional programming (MOFP) problem. When the data of (MOFP) problem are uncertain due to randomness, then it is termed as multiple-objective probabilistic fractional programming (MOPFP) problem.
In multiple-objective programming problem, there exists a set of solutions unlike single objective programming problem, which are superior to the rest of the solutions. The superiority is decided by comparing the values of objective functions. Since multiple-objective • In all objective functions X 1 is not worse than X 2 .
• At least for one objective function, X 1 is strictly better than X 2 .
In other way, non-dominated solution set is the collection of solutions, which are not dominated by other solution set.
Genetic Algorithm (GA) is the heuristic method that works on the concept of survival of the fittest, which is created by John Holland in 1975. The algorithm performs on strings known as individuals of a given population. GA is applied according to four operators. These operators are known as selection (choice), crossover (hybrid), mutation (change), and elitism.
Using a fixed iteration n, collection of population P(n) will be produced. The strings of P(n) are a solution to the mathematical problem. Utilizing the choice or selection operator, new population is obtained from the old population. The fitter string has a big likelihood of being chosen to the modern population. Then the population takes place the method of hybrid and Change. In hybrid, two parent strings are selected randomly using fixed crossover likelihood (probability) that makes best property of original strings. Using mutation, modern off springs can be made by a few alter within the quality of the chromosome according to mutation likelihood (probability).
After the method of choice, crossover and changes are completed, the other operator, which is called elitism can be connected for advancement of the coming generation. Elitism helps to handle better strings and remove bad strings. There are different elitism operators. Some of these are: alternate, partial and, complete elitism. In this manuscript, complete elitism has been used, which works with the following steps.
1. Merge the population strings before selection and after mutation so that the population is doubled.
2. Sort the resulting population in increasing or decreasing order according to the value of fitness function.
3. Then the first best half strings are selected for next generation. i.e, the strings having good fitness function remain in the system and go to another generation where as the poor strings are discarded.
When we increment the generation, the leading fitted string survives. If the ending criteria reaches, calculation stops and gives the best individual solution for the proposed problem.
The best advantages and practicability of genetic algorithm are: • GA search the solution from the population of points,not a single point.
• GA uses objective function information,not derivatives • GA can solve multiple objectives • GA uses probabilistic orators,not deterministic transitions.
• The concept of GA is easy to understand and use.
• GA is suitable for low computational fitness functions.
Even if GA has the above advantages, it has its own limitation. Some of the limitations are for high computational fitness function or high dimensional problems it takes more computation time(expensive), it needs statistical convergent solution with many simulation, the convergence of the solution depends on initial solution(strings).
We use GA instead of other Heuristic algorithm for multiple-objective cases due to the following reasons: • the probability of exploration of the search area in GA is very high comparative other heuristic algorithms.
• Simplicity and ease of implementation.
• Large and wide solution space search ability • Easy to discover global optimum and avoid trapping in local optima.
• The concept of GA is easy to understand and use.
• GA is Parallelism, easily modified and adaptable to different problems • Genetic representations using chromosomes.
Most real life mathematical programming problems involve more than one fractional objective functions involving uncertain parameters which are conflicting each other. Unlike single objective programming problems, which give unique optimal solution, there may be many non dominated solutions in multiple-objective fractional probabilistic programming problem. Finding the deterministic equivalent of such multiple objective fractional programming under discrete random variable is difficult. As a result, there must be a method that is used to solve such type of problem without finding the deterministic equivalent.
There is lack of studies which solve multiple-objective fractional programming involving discrete random variables using genetic algorithm approach. In addition, the problem has many real life applications. All the above cases, motivate me to conduct and consider the proposed mathematical model as multiple-objective probabilistic fractional programming problem. This paper has been organized into 6 Sections and at last references do appear. Section 1 focuses on introduction to multiple-objective probabilistic fractional programming and GA. Section 2 presents review of literature. Section 3 is the mathematical model of MOPFP problem. The solution procedure of MOPFP problem is stated in Section 4. Examples for the the proposed model are given in Section 5. At the last section, the conclusion is provided.

Literature survey
Many authors published the solution methodology for multiple-objective fractional mathematical problems. Such as [1] presented a method by converting into multiple-objective mathematical problem. The challenge of programming problem in real world application is deciding the precise values of available data. The programming problem under randomness is probabilistic model. To get the optimal value of these programming model, it's deterministic equivalent is found by taking the data as continuous random variable [2,3]. Some other researchers [4][5][6][7] proposed a method for stochastic programming problems having multiple-objectives. But, getting the deterministic of probabilistic model is time wastage and even difficult. To overcome this difficulty different researchers suggested GA for mathematical problem involving continuous random variable [8][9][10][11]. If few of the data of fractional mathematical problems are described by random variable, it is referred to as stochastic fractional programming. Zhu and Huang [12] stated the use of fractional mathematical problem involving random variables in the use of electric power. Das and Mandel [13] solved stochastic fractional programming problems by transforming to deterministic fractional problem. [14] showed the application of probabilistic fractional goal programming involving multiple-objectives for the distribution of water resource in industries. GA is proposed to find chance constraint fractional programming by handling the probabilistic limitations using stochastic simulation [15][16][17]. In some real life circumstances, all or some data of the probabilistic programming problem are expressed by discrete random variables. Though, the solution method of MOPFP problem involving discrete distribution does not appear in the literature. In stochastic programming problem where it is difficult to find its deterministic, [9] have estimated the probabilistic constraints by using random variable generation and stochastic simulation. Different researchers solved single objective probabilistic programming having random variables with discrete distributions [18][19][20].
From the literature that we observed, many authors tried to solve multiple-objective probabilistic programming problem by finding the deterministic equivalent. In addition some authors solved multiple-objective fractional programming problems by using classical method of fractional programming by transforming into equivalent multiple-objective programming problem. All these methods take time and even difficult to find the deterministic equivalence when the parameters involve some discrete random variables like hyper geometric and pascal distributions.
Recently, [21] presented an optimization model for software quality prediction with case study analysis using MATLA. [22] proposed Consensus based combining method for classifier ensembles. [23] studied efficient malware detection approach with feature weighting based on Harris Hawks optimization. [24] Eccentric methodology with optimization to unearth hidden facts of search engine result. [25] studied a new insight on solving fuzzy linear fractional programming in material aspects. [26] proposed fuzzy nonlinear programming approach for multi-objective sum of linear and linear fractional programming problem. [27] proposed a numerical approach for solving linear fractional programming problem in a fuzzy environment. [5] presented multi-objective probabilistic fractional programming problem involving two parameters Cauchy distribution. [28] Studied on probabilistic multi-objective linear fractional programming problems under fuzziness. [29] proposed elite artificial bees' colony algorithm to solve robot's fuzzy constrained routing problem [30] studied application of multiobjective probabilistic fractional programming problem in production planning. [31] studied application of fuzzy random-based multi-objective linear fractional programming to inventory management problem.
So in this manuscript, we have made an attempt for solving MOPFP problem having discreet random variables using stochastic simulation based genetic algorithm.

Formulation of MOPFP problem
MOPFP Problem is expressed as: 0 < a i < 1; i ¼ 1; 2; . . . ; m ð3Þ where N q (x j ) and D q (x j ) are function of x j . "P" is the probability, α i is the number in between 0 and 1 which is the violation.
In this manuscript, we consider the parameter in the coefficient of constraint and the right hand side are hyper-geometric and Pascal random variables respectively.
Suppose that x is a random variable: (a): x has Pascal distribution with known parameters n and p, whose probability mass function is equal to: it is denoted by PS(n, p) (b): x has Hyper geometric distribution, if the probability mass function is expressed: and it is denoted by H(N, m, n1). It is a discrete distribution of sampling without replacement. The parameters N, m, n 1 , N − n 1 represents total population size in both classes, sample size, first class population size and second class population size respectively.

Solution procedure
The compromise solution of the proposed mathematical programming is obtained by stochastic simulation together with GA. In this case: • Finding deterministic equivalence of chance constraint programming problem is not required • Transforming MOFP problem into non fractional mathematical problem is also not required.
The algorithms is described by the following procedure: step 0: Specify the parameters such as crossover probability (pc), mutation probability (pm), number of generation (t) and distribution parameters.  step 4: Test the likelihood condition of the limitations. In the event that the condition is satisfied at that point go to following step else go to step 1.
step 5: Apply selection operator to select the best chromosomes from the population.  step 9: Check the likelihood criteria of the limitations once more. In the event that the criteria is fulfilled at that point go to following step else go to step 1.
step 10: Apply Elitism to the present population.
step 11: Check whether max number of generation is achieved or not, if not go to step-3.
step 12: When the end condition is come to the show, the present populace gives the leading solution.
The pseudo-code for stochastic simulation based GA is described by:

Examples
One numerical example and one real life application will be discussed here as follows.

Numerical example
Consider the multiple-objective probabilistic fractional programming.
Pða 5 x 1 À a 6 x 2 þ 3x 3 � b 3 Þ � 0:65 0 � x i � 5; i ¼ 1; 2; 3: To discover the Pareto ideal solutions, we utilize stochastic recreation based GA. The stochastic reenactment GA is coded by utilizing C++ programming dialect. Within the calculation, we utilize competition determination, one point cross over and bit wise transformation administrators and the greatest generation as stopping criteria. The other parameter are given as: size of population p(t) = 100, p m = 0.001 and p c = 0.7, and maximum generation t taken as 200.
In this manuscript the GA parameters are fixed in all cases. The population size should not be very large as a huge computational time is required and which causes GA to slow down, while smaller population might not be enough for a good mating pool. Therefore, an optimal population size needs to be decided by trial and error. That is why we choose the population size p(t) = 100. Crossover has a higher probability, typically 0.7-0.95 is recommended. The experiments we did with crossover showed that a rate of 80% is good enough. This means that pc = 0.7 is sufficient for our problem. On the other hand, mutation is carried out by flipping some digits of a string, which generates new solutions. For our problem, Mutation rate is in the range of [0.001, 0.05]. In general, this mutation probability is typically low, from 0.001 to 0.05 is recommended for GA. In our cases pm = 0.001 is good choice. Number of generation refers to the number of cycles before termination. In some cases 100 loops are sufficient, but in the other cases more generation is needed. This depends on the problem type and its complexity. So in our problem t = 200 generation is sufficient.
Solving the problem using stochastic simulation GA, we got non dominated solutions which is given by Table 1 with 200 generations. The set of non dominated points are expressed by Fig 2. As we see the results,the non dominated or compromise solutions are conflicting each other. This means that when Z 1 is best then Z 2 is worst and vice versa. In this case the decision maker can choose one of the best solution depending on his/her interest.
The uncertain coefficients of the constraints are approximated by stochastic simulation based GA method. The method generates infinity many solutions,among these solution the 14 solutions are none dominated solutions.

Real life example of supplier selection in supply chain problem
Suppliers have a great role in manufacture or purchasing to satisfy the need of the customers. The main strategy of the decision maker in supply chain management is selecting the best suppliers that archive the targeted goal. In practical supplier selection is affected by conflicting criteria. The most important criteria are quality, cost and delivery time. In addition to this some parameters like total demand and maximum capacity of suppliers are affected by uncertainty. This uncertainty can be characterized by random variables having known distributions. Hence probability theory is the best tool to handle uncertainty. In this example, we develop a multiobjective fractional programming problem for supplier selection problem subject to probabilistic constraints with uncertain demand and maximum capacity of suppliers. Suppose that 4 suppliers are needed for supplying new products to a market. The market manager designed criteria for selecting suppliers based on cost of product, quality of product and delivery time. It is assumed that the total demand of the market and maximum capacity of each supplier are random variables following Pascal distribution and hyper-geometric distribution. The manager wants to select suppliers which minimize cost per late time deliver ratio and maximize quality of product per on time delivery ratio subject to probabilistic demand and supplier capacity. The supplier quantities are given by Table 2.
Model development. The supplier selection model is multiple-objective fractional programming problem with probabilistic constraints.
The cost functions are: 1. the quality of item per on time delivery.i.e 2. cost per late time delivery 1. the total product supplied by suppliers is not less than the total demand of the costumer.
2. the capacity of each supplier can not exceed from the the maximum capacity.
Results and discussion. The non dominated solutions are gotten utilizing stochastic recreation based GA by utilizing p(t) = 100, p c = 0.7, p m = 0.001 and t = 200 and dissemination data stated above. Coding stochastic reenactment based GA utilizing C++, we get the taking after non dominated ideal solutions of supplier determination demonstrate. Table 3

Conclusion
In this manuscript, MOPFP problem has been solved using stochastic simulation together with GA by waving the deterministic identical of the problem. The method doesn't require any classical method of fractional programming to convert the multiple-objective fractional programming problem into identical multiple-objective programming problem. The method is simple and easy to use which is coded by C++ programming language. Moreover, GA helps to generate many solutions at a time which are non dominated solutions. This is important for decision makers to make a good decision by considering all the possible directions. In the proposed method, when the number of iteration increases the probability of getting best non dominated solution is very high.
Since most real life problems ar uncertain due to randomness, stochastic simulation can easily handle the probabilistic constraints. For such type of mathematical problem the proposed method is used to get the non dominated solution for multiple-objective fractional uncertain problems for which the decision maker can select best supplier among many suppliers.
We recommend that the proposed problem can be solved by other heuristic algorithms like particle swarm algorithm and ant colony algorithm. In addition the problem can extended to fully fuzzy multi-objective probabilistic fractional programming problem and multi-level multi objective probabilistic fractional programming problem that involves both discrete and continuous random variables.